Constrained Polynomial Optimization Problems with Noncommuting Variables

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constrained Polynomial Optimization Problems with Noncommuting Variables

In this paper we study constrained eigenvalue optimization of noncommutative (nc) polynomials, focusing on the polydisc and the ball. Our three main results are as follows: (1) an nc polynomial is nonnegative if and only if it admits a weighted sum of hermitian squares decomposition; (2) (eigenvalue) optima for nc polynomials can be computed using a single semidefinite program (SDP) – this shar...

متن کامل

Convergent Relaxations of Polynomial Optimization Problems with Noncommuting Variables

We consider optimization problems with polynomial inequality constraints in non-commuting variables. These non-commuting variables are viewed as bounded operators on a Hilbert space whose dimension is not fixed and the associated polynomial inequalities as semidefinite positivity constraints. Such problems arise naturally in quantum theory and quantum information science. To solve them, we intr...

متن کامل

Constrained trace-optimization of polynomials in freely noncommuting variables

The study of matrix inequalities in a dimension-free setting is in the realm of free real algebraic geometry (RAG). In this paper we investigate constrained trace and eigenvalue optimization of noncommutative polynomials. We present Lasserre’s relaxation scheme for trace optimization based on semidefinite programming (SDP) and demonstrate its convergence properties. Finite convergence of this r...

متن کامل

Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems

Due to their fundamental nature and numerous applications, sphere constrained polynomial optimization problems have received a lot of attention lately. In this paper, we consider three such problems: (i) maximizing a homogeneous polynomial over the sphere; (ii) maximizing a multilinear form over a Cartesian product of spheres; and (iii) maximizing a multiquadratic form over a Cartesian product ...

متن کامل

Symmetric Functions in Noncommuting Variables

Consider the algebra Q〈〈x1, x2, . . .〉〉 of formal power series in countably many noncommuting variables over the rationals. The subalgebra Π(x1, x2, . . .) of symmetric functions in noncommuting variables consists of all elements invariant under permutation of the variables and of bounded degree. We develop a theory of such functions analogous to the ordinary theory of symmetric functions. In p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Journal on Optimization

سال: 2012

ISSN: 1052-6234,1095-7189

DOI: 10.1137/110830733